A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method
نویسندگان
چکیده
Network layer multicast is a powerful method for transmitting data from sources to multiple group members. When joining group, member first sends request designated router (DR). Then, the DR selects node in existing tree (known as node, or MJN) establish distribution path MJN itself. The selection runs on and has significant impact of tree, that directly affects load network. However, current cannot effectively detect status downlink case asymmetric routing, leading network congestion limiting number groups can accommodate (multicast capacity). To solve this problem, we propose an based reverse shortest (RSPT). RSPT paths routing asymmetry. Based detection results RSPT, select with lowest join tree. Our experimental indicate compared methods, our lower cost delay, balance increasing capacity by more than two times.
منابع مشابه
Secure Reverse Communication in a Multicast Tree
Multicast content delivery can be expected to become a major source of revenue with the increase of private broadband fixed and mobile communications. Several multicast applications require the receivers to securely send some real-time information back to the source, which leads to a many-to-one communication scenario. Using unicast connections to send this reverse traffic results in a data imp...
متن کاملEAANS: Energy Aware Adjacent Node Selection Based Optimal Shortest Path Detection in Wireless Sensor Network
Wireless sensor network (WSN) is an ad hoc network based on radio transmission for communications. It has wide variety of applicability in healthcare, military, transportation etc. Getting optimized route in WSN depends upon the number of hops used to transfer the data packets. Lesser the hops counts effective will be communications because of less energy consumption and overheads. Identifying ...
متن کاملShortest path problems with node failures
Consider the problem of finding the shortest paths from a node source s to a node sink t in a complete network. On any given instance of the problem, only a subset of the intermediate nodes can be used to go from s to t , the subset being chosen according to a given probability law. We wish to find an a priori path from s to f such that, on any given instance of the problem, the sequence of nod...
متن کاملA Note on the Weight of Multicast Shortest Path Trees
The weight of a multicast shortest path tree in the complete graph with exponential link weights is expressed as a random variable. The new framework elegantly allows the computation of the average multicast weight.
متن کاملThe New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the bandwidth to be shared by multiple receivers and simultaneously guarantee the shortest paths for each receiver node. The SBPT algorithm is a distributed algorithm with cost in the same order as the sum of the shortest p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Internet
سال: 2023
ISSN: ['1999-5903']
DOI: https://doi.org/10.3390/fi15050156